Based on the timing constraints event model of rtl ( real time logic ) , the compiling algorithms for timing constraints event transform the problem of how to detect timing constraints event to the problem of how to find negative cycle in weighted directed graph , which is named as constraints graph . by simplifying constraints graph , the efficient detecting algorithms for timing constraints event have been developed , which not only has good time complexity but also can find events that violate timing constraints as early as possible . in order to verify the event detecting methods based on dynamic rules and to check its efficiency in application , experiment schemes are designed and performed on the implemented prototype system in linux environment 帶時(shí)間約束事件的編譯算法以rtl ( realtimelogic )事件模型為基礎(chǔ),將帶時(shí)間約束事件的檢測(cè)轉(zhuǎn)化為在帶權(quán)值的有向圖(此即受限圖)中尋找負(fù)圈的問題,它通過化簡(jiǎn)受限圖得到最小有效約束集;運(yùn)行時(shí)事件檢測(cè)算法在最小有效約束集上檢查事件的時(shí)間約束,不但有較好的執(zhí)行效率,而且能盡早地發(fā)現(xiàn)違反時(shí)間約束的事件。